Money denominations: Search for optimality

On Dynamic Optimality for Binary Search Trees

Does there exist O(1)-competitive (self-adjusting) binary search tree (BST) algorithms? This is a well-studied problem. A simple offline BST algorithm GreedyFuture was proposed independently by Lucas [5] and Munro [6], and they conjectured it to be O(1)-competitive. Recently, Demaine et al. [2] gave a geometric view of the BST problem. This view allowed them to give an online algorithm GreedyAr...

Money, Search and Costly Matchmaking

I examine the robustness of monetary equilibria in a random matching model where a more efficient mechanism for trade is available. Agents choose between two trading sectors: the search and the intermediated sector. In the former, trade partners arrive randomly and there is a trading externality. In the latter a costly matching technology provides deterministic double-coincidence matches. Multi...

Commodity money with frequent search

A prominent feature of the Kiyotaki and Wright (1989) model of commodity money is the multiplicity of dynamic equilibria. We show that the frequency of search is strongly related to the extent of multiplicity. To isolate the role of frequency of search in generating multiplicity, we (i) vary the frequency of search without changing the frequency of finding a trading partner and (ii) focus on sy...

Static Optimality and Dynamic Search-Optimality in Lists and Trees

Static Optimality and Dynamic Search-Optimality in Lists and Trees1

Adaptive data structures form a central topic of on-line algorithms research. The area of Competitive Analysis began with the results of Sleator and Tarjan showing that splay trees achieve static optimality for search trees, and that Move-to-Front is constant competitive for the list update problem [ST1], [ST2]. In a parallel development, powerful algorithms have been developed in Machine Learn...